class Solution(object):

def findMedianSortedArrays\(self, nums1, nums2\):

    """

    :type nums1: List\[int\]

    :type nums2: List\[int\]

    :rtype: float

    """

    result=\[\]

    number=0

    if len\(nums1\)+len\(nums2\) %2 ==1:

        middle=len\(nums1\)+len\(nums2\)/2 +1

    else:

        middle=len\(nums1\)+len\(nums2\)/2-1



    while len\(nums1\)+len\(nums2\)>0:

        if len\(result\)== middle and len\(nums1\)+len\(nums2\) %2 ==1:

            return result\[middle-1\]

        elif len\(result\)== middle+1 and len\(nums1\)+len\(nums2\) %2 ==0: 

            return \(result\[middle-1\]+result\[middle\]\)/2

        else:

            if len\(nums1\)>0 and len\(nums2\)>0:

                if nums1\[0\]<=nums2\[0\]:

                    result.append\(nums1\[0\]\)

                    nums1=nums1\[1:\]

                elif nums1\[0\]>nums2\[0\]:

                    result.append\(nums2\[0\]\)

                    nums2=nums2\[1:\]

            elif len\(nums1\)>0:

                result+=nums1

            elif len\(nums2\)>0:

                result+=nums2



    return result



    这个不知道为什么不行。。。

但是这个可以的！

class Solution(object):

def findMedianSortedArrays\(self, nums1, nums2\):

    """

    :type nums1: List\[int\]

    :type nums2: List\[int\]

    :rtype: float

    """

    result=\[\]

    number=0

    result=nums1+nums2

    result.sort\(\)

    if len\(result\) %2 ==1:

        return result\[len\(result\)//2\]

    else:

        return \(result\[len\(result\)//2-1\]+result\[len\(result\)//2\]\)/2.0



    return result\[len\(result\)//2\]